Sign in
Facet browsing currently unavailable
Page 1 of 16644 results
Sort by: relevance publication year
|
Special issue on Theoretical Topics in Graph Transformation JOURNAL ARTICLE published September 2022 in Theoretical Computer Science |
|
Generalized metrics and uniquely determined logic programs JOURNAL ARTICLE published August 2003 in Theoretical Computer Science |
|
μ-Recursion and infinite limits JOURNAL ARTICLE published June 2003 in Theoretical Computer Science |
|
Theory of symbolic expressions, I JOURNAL ARTICLE published 1983 in Theoretical Computer Science |
|
On domain-partitioning induction criteria: worst-case bounds for the worst-case based JOURNAL ARTICLE published August 2004 in Theoretical Computer Science |
|
Factors of characteristic words of irrational numbers JOURNAL ARTICLE published June 2005 in Theoretical Computer Science |
|
NC solving of a system of linear ordinary differential equations in several unknowns JOURNAL ARTICLE published April 1996 in Theoretical Computer Science |
|
Hardness of approximating the Minimum Solutions of Linear Diophantine Equations JOURNAL ARTICLE published April 2007 in Theoretical Computer Science |
|
Repairing time-determinism in the process algebra for hybrid systems JOURNAL ARTICLE published August 2012 in Theoretical Computer Science |
|
Categorial grammars with iterated types form a strict hierarchy of JOURNAL ARTICLE published September 2012 in Theoretical Computer Science |
|
On the complexity of a family of JOURNAL ARTICLE published January 2012 in Theoretical Computer Science |
|
An extended Earley’s algorithm for Petri net controlled grammars without JOURNAL ARTICLE published August 2012 in Theoretical Computer Science |
|
Sum of digits sequences modulo JOURNAL ARTICLE published August 2011 in Theoretical Computer Science |
|
The set of parameterized JOURNAL ARTICLE published March 2012 in Theoretical Computer Science |
|
New upper bounds on the JOURNAL ARTICLE published May 2011 in Theoretical Computer Science |
|
A linear time and space algorithm for detecting path intersection in JOURNAL ARTICLE published August 2011 in Theoretical Computer Science |
|
Three-player partizan games JOURNAL ARTICLE published February 2005 in Theoretical Computer Science |
|
The essence of ideal completion in quantitative form JOURNAL ARTICLE published May 2002 in Theoretical Computer Science |
|
A new heap game JOURNAL ARTICLE published February 2001 in Theoretical Computer Science |
|
Cooperative TSP JOURNAL ARTICLE published June 2010 in Theoretical Computer Science |
![Cite](javascript:showCiteBox("10.1016/j.tcs.2012.05.027", "Repairing time-determinism in the process algebra for hybrid systems <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:msubsup><mml:mrow><mml:mstyle mathvariant="italic"><mml:mi>ACP</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mstyle mathvariant="italic"><mml:mi>hs</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mstyle mathvariant="italic"><mml:mi>srt</mml:mi></mml:mstyle></mml:mrow></mml:msubsup></mml:math>");){kind=link}
![Cite](javascript:showCiteBox("10.1016/j.tcs.2012.04.024", "Categorial grammars with iterated types form a strict hierarchy of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mi>k</mml:mi></mml:math>-valued languages");){kind=link}
![Cite](javascript:showCiteBox("10.1016/j.tcs.2011.09.022", "On the complexity of a family of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mi>k</mml:mi></mml:math>-context-free sequences");){kind=link}
![Cite](javascript:showCiteBox("10.1016/j.tcs.2012.04.043", "An extended Earley’s algorithm for Petri net controlled grammars without <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mi>λ</mml:mi></mml:math> rules and cyclic rules");){kind=link}
![Cite](javascript:showCiteBox("10.1016/j.tcs.2011.05.030", "Sum of digits sequences modulo <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mi>m</mml:mi></mml:math>");){kind=link}
![Cite](javascript:showCiteBox("10.1016/j.tcs.2011.12.052", "The set of parameterized <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mi>k</mml:mi></mml:math>-covers problem");){kind=link}
![Cite](javascript:showCiteBox("10.1016/j.tcs.2011.01.031", "New upper bounds on the <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mi>L</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math>-labeling of the skew and converse skew product graphs");){kind=link}
![Cite](javascript:showCiteBox("10.1016/j.tcs.2011.04.019", "A linear time and space algorithm for detecting path intersection in <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:msup><mml:mrow><mml:mi mathvariant="double-struck">Z</mml:mi></mml:mrow><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msup></mml:math>");){kind=link}